An Improved Convex Hull Algorithm Considering Sort in Plane Point Set
نویسندگان
چکیده
منابع مشابه
Computing the convex hull of a planar point set
In Figure 1, the set S consists of thirteen points. The output of a convex hull algorithm should be the list (p1, p2, p3, p4, p5, p6). We remark that the list storing the vertices of CH (S) can start with an arbitrary vertex. In the example, the list (p3, p4, p5, p6, p1, p2) would also be a valid output. ∗School of Computer Science, Carleton University, Ottawa, Ontario, Canada K1S 5B6. E-mail: ...
متن کاملAn improved insert sort algorithm
Many algorithms involve a search, and they typically require two types of test: one test checks for the element being searched for, and another test is required to check the search remains within the bounds of the data structure being searched. Both of these tests can be combined into one by using a so-called sentinel. In particular, sentinels can be used in insert sort algorithms to make them ...
متن کاملA fast parallel algorithm for finding the convex hull of a sorted point set
We present a parallel algorithm for nding the convex hull of a sorted point set. The algorithm runs in O(log log n) (doubly logarithmic) time using n= log logn processors on a Common CRCW PRAM. To break the (log n= loglog n) time barrier required to output the convex hull in a contiguous array, we introduce a novel data structure for representing the convex hull. The algorithm is optimal in two...
متن کاملAn Associative Dynamic Convex Hull Algorithm
This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the Jarvis March Algorithm. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and maximum functions. Also, ASC can be sup...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of IKEEE
سال: 2013
ISSN: 1226-7244
DOI: 10.7471/ikeee.2013.17.1.029